Computing approximate blocking probabilities for a class of all-optical networks - INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies
نویسنده
چکیده
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a path and a wavelength o n that path. Moreover, o n the links of that path n o other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabilities for the optical network model for two routing schemes: Fixed Routing and Least Loaded Routing.
منابع مشابه
Computing Approximate Blocking Probabilities in Wavelength Routed All-Optical Networks with Limited- - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
Absfrcrcf-In this paper, we propose a method to calculate the average blocking probability in all-optical networks using limited-rmge wavelength conversion. Previous works have shown that there is a remarkable improvement in blocking probability while using limited-range wavelength conversion [2], [3] but these analytical models were either for a path [2] or for a mesh-torus network [3]. Using ...
متن کاملThe Use of Communications Networks to Increase Personal Privacy - INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies
Communications Networks can separate as well as join iMormation. This ability can be used to increase personal privacy in an environment where advances in technology makes it possible to collect and correlate increasing amounts of information about individuals. The tools and principles necessary to increase personal privacy are demonstrated by creating an anonymous credit card, in which a perso...
متن کاملComputing Approximate Blocking Probabilities for a Class of All-Optical Networks
We study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a path and a wavelength on that path. Moreover, on the links of that path no other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabilitie...
متن کاملDocument Marking and Identification using Both Line and Word Shifting - INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies
We continue our study of document marking t o deter illicit dissemination. A n experiment we performed reveals that the distortion on the photocopy of a document is very different in the vertical and horizontal directions. This leads to the strategy that marks a text line both vertically using line shifting and horizontally using word shifting. A line that is marked is always accompanied by two...
متن کاملComputing blocking probabilities in multiclass wavelength-routing networks with multicast calls
We present an approximate analytical method to compute efficiently the call-blocking probabilities in wavelength-routing networks with multiple classes of both unicast and multicast calls. Our approach involves the following steps. We start with an approximate solution to a linear single-class unicast network which we developed earlier. Next, all classes of calls on a particular route are aggre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004